Recognition algorithm
method
ID: recognitionalgorithm
Related Papers
An Alternative Conception of Tree-Adjoining Derivation
The precise formulation of derivation for tree- adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language …...
Parsing Graphs with Hyperedge Replacement Grammars
Hyperedge replacement grammar (HRG) is a formalism for generating and trans- forming graphs that has potential appli- cations in natural language understand- ing and generation. A recognition al- gorithm due …...
Weighted DAG Automata for Semantic Graphs
AbstractGraphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, …...