search

virtualvinodh / aksharamukha-python

Aksharamukha Python Library
GNU Affero General Public License v3.0
43 stars 15 forks source link

Complexity of transliteration? #1

Closed ibraheem-moosa closed 8 months ago

ibraheem-moosa commented 3 years ago

Hi. Really nice library. It has been really helpful for my research. I have a question regarding the function transliterate.process.

What is the complexity of this function?

virtualvinodh commented 3 years ago

That's a good question.

I actually don't know.

If you could figure it out maybe using https://github.com/pberkes/big_O that would be great :)

V

ibraheem-moosa commented 3 years ago

Sure. I will look into it.

akprasad commented 8 months ago

In general, transliteration is O(nk), where n is the length of the input and k measures the complexity of the input-output mapping.