International Conference on Acoustics, Speech, and Signal Processing · 2003 · 13 citations · 4 references
Language StudiesComputer ScienceLinguisticsComputational LinguisticsNatural Language ProcessingSyntaxGrammarNatural Language UnderstandingParsingSyntactic AnalysisSyntactic ParsingSyntax ParsingBest-first SearchContext-free Grammar ParsingContext-free GrammarsExample SentencesGrammatical AgreementParsing AlgorithmsSyntactic StructuresUnification
A natural language system, TINA, which integrates key ideas from context-free grammars, augmented transition networks (ATNs), and unification grammars has been developed. The parser uses a best-first search strategy, with probability assignments on all arcs obtained automatically from a set of example sentences. An initial context-free grammar, derived from the example sentences, is converted to an implicit probabilistic network structure. Control includes both top-down and bottom-up cycles, and key parameters are passed among nodes to deal with long-distance movement and agreement constraints. The probabilities provide a natural mechanism for exploring more common grammatical constructions first. Arc probabilities reduce test-set perplexity sixfold. A strategy for dealing with movement that can handle nested and chained gaps efficiently and rejects crossed gaps is introduced.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
4