1

The lexical path of the dual-route hypothesis of reading states that people recognize whole words from memory. Does this theory assume the search time becomes greater with more words in the lexicon?? Analogous to how a search algorithm increases it is execution time with more entries. The increase there depends on the time complexity. Hence, what is the assumed time complexity of the search in the lexical path.

Improve this question
6
  • 2
    Psycholinguistic research reveals that the time increases logarithmically so with tens of thousands of word forms the increase is negligible and almost within statistical error.
    – Atamiri
    Jun 8, 2020 at 20:48
  • Google's parallel architecture has almost no search time. It's blazing fast!
    – vectory
    Jun 8, 2020 at 22:05
  • A great deal depends on what's being searched for and how the search space is indexed. Most search strategies are adapted for particular contexts and purposes, and raw size of the space is not often a criterion. Especially if it's well-indexed or -hashed.
    – jlawler
    Jun 8, 2020 at 22:17
  • @Atamiri. What does the tens of thousands of words stand for? A person's vocabullary?
    – Borut Flis
    Jun 9, 2020 at 6:44
  • 1
    Yes, the lexicon.
    – Atamiri
    Jun 9, 2020 at 9:11

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.