| 英文摘要 |
In this paper, we first review some theoretical complexity results relevant to NLP and we show both their interest and inherent limitations. We then argue for a notion of effective complexity and, we try to identify effective sources of complexity and sources of determinism in natural language processing. Finally, we show how the former can be tamed by using the latter in order to guarantee effectiveness of language computations. |
本站僅提供期刊文獻檢索。
