Declarative Programming and Natural Language |
| | Abstract | This paper analyzes benefits and challenges (together with possible solutions) of using natural language processing for data entry and computer programming.
The paper looks at data entry in existing declarative languages and the underlying relational model is analyzed, also covering the subject of semantic networks. Context-free grammars are described in the context of natural language parsing, and modified Earley parsing algorithm is described and implemented, dispensing with some unnecessary complexities of the original.
A number of challenges of natural language are described, from the difficulties of identifying and classifying lexemes, to the ambiguous constructions of everyday English.
The paper concludes that while natural language is too complex for computers to grok in the general case, natural language may be viable in highly domain-specific areas. | | Type | Bachelor of Engineering thesis [Academic thesis] | | Year | 2007 | | Publisher | Informatics and Mathematical Modelling, Technical University of Denmark, DTU | | Address | Richard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby | | Series | IMM-B.Sc-2007-16 | | Electronic version(s) | [pdf] | | BibTeX data | [bibtex] | | IMM Group(s) | Computer Science & Engineering |
|