Editing Faculty of Arts

Title: Faculty of Arts

Research Question: How can we improve the efficiency of parsing algorithms used in the field of computer science and computational linguistics?

Methodology: The authors propose a technique called "tabular parsing," which is a form of dynamic programming. It involves creating a table that stores fragments of parses, allowing for the efficient computation and representation of exponentially many parses in polynomial time and space.

Results: The authors present several specific tabular parsing algorithms, including Earley's algorithm, the Cocke-Kasami-Younger algorithm, and tabular LR parsing. They also discuss compact representations of sets of parse trees.

Implications: The use of tabular parsing techniques can lead to more efficient parsing algorithms, which can be particularly beneficial in fields such as computer science and computational linguistics where large amounts of data need to be processed. Additionally, the modular design of these algorithms allows for easier implementation and understanding.

Link to Article: https://arxiv.org/abs/0404009v1
Authors: 
arXiv ID: 0404009v1

[[Category:Computer Science]]
[[Category:Parsing]]
[[Category:Algorithms]]
[[Category:Tabular]]
[[Category:Can]]
[[Category:Computer]]