Back to results
US 2014/0280358 A1Published application
Machine for recognizing or generating jabba-type sequences
AssigneeYahoo! Inc.
InventorsJosh Coalson, Muxin Zhou
Life of this patent
Estimating the term…
Abstract
Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more computing devices to facilitate or otherwise support one or more processes or operations for a machine for recognizing or generating one or more Jabba-type sequences.
Claims20
A method comprising:
- electronically generating an in-memory representation of an abstract syntax tree based, at least in part, on one or more Jabba-type rules descriptive of one or more named terms;
- and
- electronically generating a directed graph to determine one or more finite state machines comprising a plurality of states represented via one or more nodes of said directed graph corresponding to one or more match points along at least one sequence of candidate atoms and a plurality of transitions between said states based, at least in part, on said abstract syntax tree.
An apparatus comprising:
- a computing platform comprising at least one processor to:
- electronically generate an in-memory representation of an abstract syntax tree based, at least in part, on one or more Jabba-type rules descriptive of one or more named terms;
- and
- electronically generate a directed graph to determine one or more finite state machines comprising a plurality of states represented via one or more nodes of said directed graph corresponding to one or more match points along at least one sequence of candidate atoms and a plurality of transitions between said states based, at least in part, on said abstract syntax tree.
1 more element
An article comprising:
- a non-transitory storage medium having instructions stored thereon executable by a special purpose computing platform to:
- electronically generate an in-memory representation of an abstract syntax tree based, at least in part, on one or more Jabba-type rules descriptive of one or more named terms;
- and
- electronically generate a directed graph to determine one or more finite state machines comprising a plurality of states represented via one or more nodes of said directed graph corresponding to one or more match points along at least one sequence of candidate atoms and a plurality of transitions between said states based, at least in part, on said abstract syntax tree.
1 more element
Dependencies are inferred from the claim text.