Abstract
Over the last few years, constraint-based grammar formalisms have become the predominant paradigm in natural language processing and computational linguistics From the viewpoint of computer science typed feature structures can be seen as data structures that allow the representation of linguistic knowledge in a uniform fashion Type expansion is an operation that makes constraints of a typed feature structure explicit and determines its satisfiability We describe an efficient expansion algorithm that takes care of recursive type definitions and permits the exploration of different expansion strategies through the use of control knowledge. This knowledge is specified on a separate layer independent of grammatical information. The algorithm as presented in the paper, has been full implemented in COMMON LISP and is an integrated part of the typed feature formalism TDC that is employed in several large NL projects.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
