Hacker News new | past | comments | ask | show | jobs | submit login

Yes and the fact that the number of unique phrases grows so quickly with n is why the bloom filter needs to grow so that hashed n-grams don't collide.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: