| Lemma | evaluable path |
|---|---|
| Categoria grammaticale | N |
| Lingua | inglese |
| Sigla | Corbett & Fraser (2004) |
| Titolo | NETWORK MORPHOLOGY. A DATR account of Russian nominal inflection |
| Sinonimi | |
| Rinvii | |
| Traduzioni | |
| Citazioni | DATR offers the possibility of defining "evaluable paths". These have the following form (where N ≥ 1): (7) Node1: 〈PathX〉 == 〈"〈Path1〉"..."〈PathN〉"〉. This equation can be used to create a path by evaluating separately the paths from "〈Path1〉" to "〈PathN〉" and concateneting the result values. |