An Experience on Natural Language Parsing1 (original) (raw)

An experience on natural language parsing

… naturales y lenguajes …, 1996

We propose an interactive development descriptive adequation does not environment for the automatic guarantee operational efficiency, which generation of natural language is required for practical systems. In fact, analyzers from definite clause natural language analyzers today are grammars. Our system has been often based on depth-first left-to-right baptized GALENA, and it is organized parsing schema with backtracking. This around a generator of logical push-allows the consideration of effective down automata, which are interpreted space recovery techniques, a crucial in dynamic programming. An extensible point in NLP due to the complexity of user graphical interface provides a its computational treatment. However, complete set of customization and trace these implementations do not guarantee facilities for the system. In relation to sharing of computations even previous approaches, our proposal operational completeness. As a guarantees operational completeness consequence, actual systems in NLP and correctness at the time that often go far from the declarative model efficiency increases.

DPL – a computational method for describing grammars and modelling parsers

1985

constituent-pairs (ie. words or recognized phrase constructs) and (3) description of constituent surroundings in the form of two-way automata. The compilation of DPL-grammars results in e>;ecutable codes of corresponding parsers. To ease the modelling of grammars there exists a linguistically oriented programming environment, which contains e.g. tracing facility for the parsing process, grammar—sensitive lexical maintenance programs, and routines for the interactive graphic display of parse trees and grammar definitions. Translator routines are also available for the transport of compiled code between various LISP-dialects. The DPL-compiler and associated tools can be used under INTERLISP and FRANZLISPThis paper focuses on knowledge engineering issues. Linguistic argumentation we have presented in 73/ and 74/The detailed syntax of DPL with examples can be found in 727.

Incremental parsing for interactive natural language interface

2001

This paper proposes an effective incremental parsing method for such interactive natural language processing systems as real-time dialogue systems, simultaneous machine interpreting systems, etc. This method produces the analysis of the input while it is being received. It can efficiently deal with not only the normal input, which is piecemeal addition to the input from left to right, but also such changes of the input as insertion and deletion. For such changes of the input, this method exploits the parts of the previous analyses. We implemented this method on the workstation and made a experiment. We have confirmed that the method can be expected to be useful for an on-line language processing system.

A Symmetrical Approach to Parsing and Generation

Lexica! Grammars are a class of unification g,'ammars which share a fixed rule component, for which lhere exists a simple left-recursion elimination transformation. The parsing and generation programs ae seen as two dual non-left-recursive versions of the original grammar, and are implemented through a standard top-down Prolog interpreter. Formal criteria for termination are given as conditions on lexical enlrics: during parsing as well as during generution the processing of a lexical entry consumes some amount of a guide; the guide used for parsing is a list of words remaining to be analyzed, while the guide for genration is a list of the semantics of constituents waiting to be generated.

An Assumptive Logic Programming Methodology for Parsing

International Journal on Artificial Intelligence Tools, 2001

We show how two novel tools in logic programming for AI (namely, continuation-based linear and timeless assumptions, and Datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for Datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words) that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.

Prototyping Efficient Natural Language Parsers

International Conference Recent Advances in Natural Language Processing, Proceedings, pp. 246-250, Borovets, Bulgaria, 2007. ISBN 978-954-91743-7-3., 2007

We present a technique for the construction of efficient prototypes for natural language parsing based on the compilation of parsing schemata to executable implementations of their corresponding algorithms. Taking a simple description of a schema as input, Java code for the corresponding parsing algorithm is generated, including schema-specific indexing code in order to attain efficiency.

Parsing as Dynamic Interpretation

1993

In this paper we consider the merging of the language of feature structures with a formal logical language, and how the semantic definition of the resulting language can be used in parsing. For the logical language we use the language EL, defined and implemented earlier for compu­ tational semantic purposes. To this language we add the basic constructions and operations of feature structures. The extended language we refer to as 'Generalized EL' , or 'GEL' . The seman­ tics of EL, and that of its extension GEL, is defined model-theoretically: for each construction of the language, a recursive rule describes how its value can be computed from the values of its constituents. Since GEL talks not only about semantic objects and their relations but also about syntactic concepts, GEL models are nonstandard in containing both kinds of entities. Whereas phrase-structure rules are traditionally viewed procedurally, as recipes for building phrases, and a rule in the parsing-as...