The EL-family of description logics are a relatively well-investigated field, in particular due to EL and some of its extensions allowing for polynomial reasoning. This makes them the logical choice for many applications where efficiency and scalability are required. In the biomedical domain, EL has been successfully employed for the development of several large ontologies. Answering regular path queries (RPQs) has been investigated for many tractable and intractable extensions of EL, and they have found their way into SPARQL under the name of property paths. On the other hand, approximate semantics for answering RPQs over description logic knowledge bases have only been proposed recently. In this work, we bridge the gap between theory and practice for answering 2RPQs under approximate semantics over both a tractable and an intractable member of the EL-family. To this end, we have extended the notion of approximate semantics from ELH to ELHI_Bottom, and developed and implemented a practical procedure to answer 2RPQs under approximate semantics for both ELH and ELHI_Bottom knowledge bases.