Abstract

Problems in parsing conjoined phrases with conjuncts of different syntactic type can apparently be overcome with techniques developed for type synthesis in λ-calculus and programming languages. We briefly review the notions of parameter-, subtype- and let-polymorphism developed in functional programming, and then exhibit an analogy to parsing of conjoined phrases in natural languages.

Full Text
Paper version not known

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 call