• Login
    View Item 
    •   Athenaeum Home
    • Institute for Artificial Intelligence
    • CASPR Research Reports
    • View Item
    •   Athenaeum Home
    • Institute for Artificial Intelligence
    • CASPR Research Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Discontinuous dependency parsing of free and fixed word order: Work in progress

    Thumbnail
    View/Open
    ai199402.dvi (22.53Kb)
    ai199402.pdf (92.10Kb)
    ai199402.ps (211.6Kb)
    Date
    1994-04
    Author
    Covington, Michael A.
    Metadata
    Show full item record
    Abstract
    The dependency–based free–word–order parsing algorithm of Covington (1987, 1990, 1992) can be extended to handle partly or completely fixed word order, while preserving its psychologically realistic preference for near attachment. By adding predictivity, this algorithm can be adapted to parse left–branching and right–branching structures in less stack space than center–embedded structures, just as the human parser appears to do.
    URI
    http://hdl.handle.net/10724/30213
    Collections
    • CASPR Research Reports

    About Athenaeum | Contact Us | Send Feedback
     

     

    Browse

    All of AthenaeumCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    About Athenaeum | Contact Us | Send Feedback