Thank you all for your feedback! And apologies for posting this in the wrong place, I thought that section was the right one. As for character limits, I haven't tested it with extremely long inputs, but I'm sure there is some technical limit in place. In practice though, it's unlikely to be something worth worrying about. One important limitation is related to how the search index works, not every substring can be found. For example, if the text contains: and you search for 'long', it won't be found. It will only match if you search for 'somelongtext', 'text1' or 'text2'. This behavior comes from the way the text is indexed and it's similar to how Google and other search engines handles tokenized search. Technically, I could implement searching the text letter by letter without indexing, but with the amount of text data (tens of gigabytes), the query would take minutes instead of seconds. Thanks for your interest, I really appreciate it! For now, I'm not planning to publish the source code. A large part of it is shared with some of my other private projects, so I would prefer to keep it private. I hope you understand. Thank you for the suggestion! I agree it could be clearer. I'll try to improve the website when I have some time.
Thank you all for your feedback! And apologies for posting this in the wrong place, I thought that section was the right one. As for character limits, I haven't tested it with extremely long inputs, but I'm sure there is some technical limit in place. In practice though, it's unlikely to be something worth worrying about. One important limitation is related to how the search index works, not every substring can be found. For example, if the text contains: and you search for 'long', it won't be found. It will only match if you search for 'somelongtext', 'text1' or 'text2'. This behavior comes from the way the text is indexed and it's similar to how Google and other search engines handles tokenized search. Technically, I could implement searching the text letter by letter without indexing, but with the amount of text data (tens of gigabytes), the query would take minutes instead of seconds. Thanks for your interest, I really appreciate it! For now, I'm not planning to publish the source code. A large part of it is shared with some of my other private projects, so I would prefer to keep it private. I hope you understand. Thank you for the suggestion! I agree it could be clearer. I'll try to improve the website when I have some time.

Thank you all for your feedback! And apologies for posting this in the wrong place, I thought that section was the right one. As for character limits, I haven't tested it with extremely long inputs, but I'm sure there is some technical limit in place. In practice though, it's unlikely to be something worth worrying about. One important limitation is related to how the search index works, not every substring can be found. For example, if the text contains: and you search for 'long', it won't be found. It will only match if you search for 'somelongtext', 'text1' or 'text2'. This behavior comes from the way the text is indexed and it's similar to how Google and other search engines handles tokenized search. Technically, I could implement searching the text letter by letter without indexing, but with the amount of text data (tens of gigabytes), the query would take minutes instead of seconds. Thanks for your interest, I really appreciate it! For now, I'm not planning to publish the source code. A large part of it is shared with some of my other private projects, so I would prefer to keep it private. I hope you understand. Thank you for the suggestion! I agree it could be clearer. I'll try to improve the website when I have some time.

Thank you all for your feedback! And apologies for posting this in the wrong place, I thought that section was the right one. As for character limits, I haven't tested it with extremely long inputs, but I'm sure there is some technical limit in place. In practice though, it's unlikely to be something worth worrying about. One important limitation is related to how the search index works, not every substring can be found. For example, if the text contains: and you search for 'long', it won't be found. It will only match if you search for 'somelongtext', 'text1' or 'text2'. This behavior comes from the way the text is indexed and it's similar to how Google and other search engines handles tokenized search. Technically, I could implement searching the text letter by letter without indexing, but with the amount of text data (tens of gigabytes), the query would take minutes instead of seconds. Thanks for your interest, I really appreciate it! For now, I'm not planning to publish the source code. A large part of it is shared with some of my other private projects, so I would prefer to keep it private. I hope you understand. Thank you for the suggestion! I agree it could be clearer. I'll try to improve the website when I have some time.